Boundary vertices in graphs
نویسندگان
چکیده
منابع مشابه
Graphs with Four Boundary Vertices
A vertex v of a graph G is a boundary vertex if there exists a vertex u such that the distance in G from u to v is at least the distance from u to any neighbour of v. We give a full description of all graphs that have exactly four boundary vertices, which answers a question of Hasegawa and Saito. To this end, we introduce the concept of frame of a graph. It allows us to construct, for every pos...
متن کاملFuzzy Detour Boundary Vertices in Fuzzy Graphs
A vertex v in a connected fuzzy graph G is a fuzzy detour boundary vertex of a vertex u, if ) , ( ) , ( v u w u Δ ≤ Δ for every fuzzy detour neighbour w of v. This paper is devoted to see how the fuzzy detour boundary vertices are related to fuzzy detour interior vertices. Further, the relation between the fuzzy detour boundary vertices and fuzzy detour eccentric vertices are also studied. Some...
متن کاملDirected graphs and its Boundary Vertices
Suppose that D = (V,E) is a strongly connected digraph. Let u, v ∈ V (D). The maximum distance md(u, v) is defined as md(u, v)=max{ −→ d (u, v), −→ d (v, u)} where −→ d (u, v) denote the length of a shortest directed u− v path in D. This is a metric. The boundary, contour, eccentric and peripheral sets of a strong digraph D are defined with respect to this metric. The main aim of this paper is ...
متن کاملAsymptotic enumeration on self-similar graphs with two boundary vertices
We study two graph parameters, namely the number of spanning forests and the number of connected subgraphs, for self-similar graphs with exactly two boundary vertices. In both cases, we determine the general behavior for these and related auxiliary quantities by means of polynomial recurrences and a careful asymptotic analysis. It turns out that the so-called resistance scaling factor of a grap...
متن کاملClustering Vertices in Weighted Graphs
Clustering is the unsupervised process of discovering natural clusters so that objects within the same cluster are similar and objects from different clusters are dissimilar. In clustering, if similarity relations between objects are represented as a simple, weighted graph where objects are vertices and similarities between objects are weights of edges; clustering reduces to the problem of grap...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2003
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(02)00567-8